Removing Independently Even Crossings

Removing Even Crossings on Surfaces

We give a new, topological proof that the weak Hanani-Tutte theorem is true on orientable surfaces and extend the result to nonorientable surfaces. That is, we show that if a graph G cannot be embedded on a surface S, then any drawing of G on S must contain two edges that cross an odd number of times. We apply the result and proof techniques to obtain new and old results about generalized thrac...

On the average number of sharp crossings of certain Gaussian random polynomials

Removing Even Crossings, Continued

In this paper we investigate how certain results related to the HananiTutte theorem can be lifted to orientable surfaces of higher genus. We give a new simple, geometric proof that the weak Hanani-Tutte theorem is true for higher-genus surfaces. We extend the proof to prove that bipartite generalized thrackles in a surface S can be embedded in S. We also show that a result of Pach and Tóth that...

Ordering Metro Lines by Block Crossings

A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually equivalent. We suggest merging single crossings into block crossings, that is, crossings of two neighboring groups of consecutive lines. Unfortunately, minimizing ...

Removing even crossings

An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and Tóth proved that a graph can always be redrawn such that its even edges are not involved in any intersections. We give a new, and significantly simpler, proof of a slightly stronger statement. We show two applications of this strengthened result: an easy proof of a the...